Distributed Symbolic Computation with DTS
نویسندگان
چکیده
We describe the design and implementation of the Distributed Threads System (DTS), a programming environment for the paralleliza-tion of irregular and highly data-dependent algorithms. DTS extends the support for fork/join parallel programming from shared memory threads to a distributed memory environment. It is currently implemented on top of PVM, adding an asynchronous RPC abstraction and turning the net into a pool of anonymous compute servers. Each node of DTS is multi-threaded using the C threads interface and is thus ready to run on a multiprocessor workstation. We give performance results for a parallel implementation of the RSA cryptosystem, parallel long integer multiplication , and parallel multi-variate polynomial resultant computation.
منابع مشابه
An Object-Oriented Platform for Distributed High-Performance Symbolic Computation
We describe the Distributed Object-Oriented Threads System (DOTS), a programming environment designed to support object-oriented fork/join parallel programming in a heterogeneous distributed environment. A mixed network of Windows NT PC’s and UNIX workstations is transformed by DOTS into a homogeneous pool of anonymous compute servers forming together a multicomputer. DOTS is a complete redesig...
متن کاملAn Efficient Feedback-based Trust Model for Pervasive Computing
In pervasive computing environments, pervasive devices should collaborate effectively such that the vision of pervasive computing will come true. However, without trust, pervasive devices cannot collaborate effectively. Distributed trust systems (DTS) may support trust and thus foster collaboration in hostile pervasive computing environments. The challenge for DTS is how to aggregate the local ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملScaling to Large3 Data: An Efficient and Effective Method to Compute Distributional Thesauri
We introduce a new highly scalable approach for computing Distributional Thesauri (DTs). By employing pruning techniques and a distributed framework, we make the computation for very large corpora feasible on comparably small computational resources. We demonstrate this by releasing a DT for the whole vocabulary of Google Books syntactic n-grams. Evaluating against lexical resources using two m...
متن کاملOn the role of distributed computing in Symbolic Computation for Algebraic Topology
In this work, we report on the preliminary analysis carried out in order to undertake the task of designing and building distributed systems for Symbolic Computation in Algebraic Topology. We try to make explicit how the peculiarities of the programs computing homology and homotopy groups can influence on the development of distributed systems to perform the same calculations. We stress not onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995